Graph Based Crossover – A Case Study with the Busy Beaver Problem
نویسندگان
چکیده
The success of the application of evolutionary approaches depends, to a large extent, on problem representation and on the used genetic operators. In this paper we introduce a new graph based crossover operator and compare it with classical two-point crossover. The study was carried out using a theoretical hard problem known as Busy Beaver. This problem involves the search for the Turing Machine that produces the maximum number of ones when started on a blank tape. Experimental results show that, in this domain, the new graph-based operator provides a clear advantage over two-point crossover.
منابع مشابه
(Preliminary Version) Evolutionary Turing Machines – The Quest for Busy Beavers
In this chapter we study the feasibility of using Turing Machines as a model for the evolution of computer programs. To assess this idea we select, as test problem, the Busy Beaver a well-known theoretical problem of undisputed interest and difficulty proposed by Tibor Rado in 1962. We focus our research on representational issues and on the development of specific genetic operators, proposing ...
متن کاملSolving Busy Beaver Problem using Farmer/Worker Scheme in the context of Worldwide Computer
In this paper we present the aspects of solving complex problems using Worldwide Computing based distributed approach. The Busy Beaver Problem of distributed Turing Machine emulation is considered as a running example.
متن کاملBusy Beaver – An Evolutionary Approach
The Busy Beaver is an interesting theoretical problem proposed by Tibor Rado in 1962. Since then, it has attracted the attention of many researchers and several contests were organised trying to produce good solutions. In this paper, we propose an evolutionary approach to the problem. Our experimental results prove that this technique is very effective in attacking Busy Beaver, since we were ab...
متن کاملA Busy Beaver Problem for Infinite-Time Turing Machines
This note introduces a generalization to the setting of infinite-time computation of the busy beaver problem from classical computability theory, and proves some results concerning the growth rate of an associated function. In our view, these results indicate that the generalization is both natural and promising.
متن کاملDynamical systems approach to the Busy Beaver problem
The purpose of this paper is to reconsider the Busy Beaver problem, which is a modification of the Turing machine’s halting problem, in the light of a dynamical systems approach. Numerical experiments show that the spatio-temporal patterns of machines can be roughly classified into four types. In particular, well-regulated and self-similar patterns are found in most longer-lived machines, which...
متن کامل